Computing the similarity of two sequences with nested arc annotations
نویسندگان
چکیده
منابع مشابه
Computing the similarity of two sequences with nested arc annotations
We present exact algorithms for the NP-complete Longest Common Subsequence problem for sequences with nested arc annotations, a problem occurring in structure comparison of RNA. Given two sequences of length at most n and nested arc structure, one of our algorithms determines (if existent) in O(3.31k1+k2 · n) time an arc-preserving subsequence of both sequences, which can be obtained by deletin...
متن کاملComputing the Similarity of Two Sequences with Nested Arc Annotations 1 Jochen Alber
We present exact algorithms for the NP-complete Longest Common Subsequence problem for sequences with nested arc annotations, a problem occurring in structure comparison of RNA. Given two sequences of length at most n and nested arc structure, one of our algorithms determines (if existent) in O(3.31k1+k2 · n) time an arc-preserving subsequence of both sequences, which can be obtained by deletin...
متن کاملComputing the Similarity of Two Sequences with Nested Arc Annotations 1
We present exact algorithms for the NP-complete Longest Common Subsequence problem for sequences with nested arc annotations, a problem occurring in structure comparison of RNA. Given two sequences of length at most n and nested arc structure, one of our algorithms determines (if existent) in O(3.31k1+k2 · n) time an arc-preserving subsequence of both sequences, which can be obtained by deletin...
متن کاملTowards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time
We present exact algorithms for the NP-complete Longest Common Subsequence problem for sequences with nested arc annotations, a problem occurring in structure comparison of RNA. Given two sequences of length at most n and nested arc structure, our algorithm determines (if existent) in time O(3.3112 ·n) an arc-preserving subsequence of both sequences, which can be obtained by deleting (together ...
متن کاملMeasuring the Similarity of Two Image Sequences
We propose a novel similarity measure of two image sequences based on shapeme histograms. The idea of shapeme histogram has been used for single image/texture recognition, but is used here to solve the sequence-tosequence matching problem. We develop techniques to represent each sequence as a set of shapeme histograms, which captures different variations of the object appearances within the seq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2003.10.026